The Complexity of Cardinality Restri tions 2 . The Logi
نویسنده
چکیده
منابع مشابه
Computational Restri tions for SPN with Generally Distributed Transition Times
The analysis of sto hasti systems with non-exponential timing requires the development of suitable modeling tools. Re ently, some e ort has been devoted to generalize the on ept of Sto hasti Petri nets, by allowing the ring times to be generally distributed. The evolution of the PN in time be omes a sto hasti pro ess, for whi h in general, no analyti al solution is available. The paper des ribe...
متن کاملSimulation Logic, Applets and Compositional Verification
We present a ompositional veri ation method for ontrol ow based safety properties of smart ard applets. Our method rests on a lose orresponden e between transition system models ordered by simulation and Hennessy-Milner logi extended with simultaneous greatest xed points. We show that simulation an be hara terised logi ally and, vi e versa, logi al satisfa tion an be represented behaviourally b...
متن کاملFeature Logics and Refinement
In this paper, we present an institution of feature logi s whi h generalises the earlier approa h of [6℄ in various way. Then we de ne a re nement theory to deal with the omplexity of feature intera tions in this generi framework. Indeed, one of the main problem en ountered when dealing with feature intera tion is the omplexity of the dete tion. There is a general agreement on the point that im...
متن کاملA Signal Processing Approach to Estimate Underwater Network Cardinalities with Lower Complexity
An inspection of signal processing approach in order to estimate underwater network cardinalities is conducted in this research. A matter of key prominence for underwater network is its cardinality estimation as the number of active cardinalities varies several times due to numerous natural and artificial reasons due to harsh underwater circumstances. So, a proper estimation technique is mandat...
متن کاملApproximating integer programs with positive right-hand sides
1 Department of Computer and Information S ien e, Linköpings universitet, SE-581 83 Linköping, Sweden 2 É ole polyte hnique, Laboratoire d'informatique (LIX), 91128 Palaiseau Cedex, Fran e Abstra t. We study minimisation of integer linear programs with positive right-hand sides. We show that su h programs an be approximated within the maximum absolute row sum of the onstraint matrix A whenever ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000